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 17, 2026 03:30Kevin HeaveyKevin HeaveyScore: 3,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 03:333,70040,505,08529,490,0001,223,0002,117,632
2Jul 17, 2026 03:333,70140,500,02529,695,0001,025,0002,117,632
3Jul 17, 2026 03:333,71240,582,33729,759,0001,052,0002,117,632
4Jul 17, 2026 03:333,71640,606,98629,825,0001,023,0002,117,632
5Jul 17, 2026 03:333,71840,743,31129,834,0001,026,0002,117,632
6Jul 17, 2026 03:333,77040,947,68230,255,0001,039,0002,117,632
7Jul 17, 2026 03:333,77741,006,36930,310,0001,040,0002,117,632
8Jul 17, 2026 03:333,77941,140,06330,324,0001,044,0002,117,632
9Jul 17, 2026 03:333,80341,277,49430,259,0001,313,0002,117,632