Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 6, 2026 18:10Kevin HeaveyKevin HeaveyScore: 4,948Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:114,78649,343,56738,443,0001,281,0002,117,632
2Jul 6, 2026 18:114,85049,831,31139,241,0001,018,0002,117,632
3Jul 6, 2026 18:114,87750,088,39939,230,0001,251,0002,117,632
4Jul 6, 2026 18:114,90750,258,79039,480,0001,255,0002,117,632
5Jul 6, 2026 18:114,94850,648,31039,834,0001,235,0002,117,632
6Jul 6, 2026 18:114,95150,628,95939,854,0001,242,0002,117,632
7Jul 6, 2026 18:114,98750,883,93440,156,0001,239,0002,117,632
8Jul 6, 2026 18:115,03451,312,13540,507,0001,280,0002,117,632
9Jul 6, 2026 18:115,06851,636,22541,045,0001,020,0002,117,632