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 listJan 31, 2026 11:17olliecrowolliecrowScore: 6,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 11:176,36382,444,75648,831,0003,986,0002,289,664
2Jan 31, 2026 11:176,38681,728,75751,000,0002,000,0002,367,488
3Jan 31, 2026 11:176,39879,409,60651,097,0002,003,0002,301,952
4Jan 31, 2026 11:176,67980,657,72953,418,0002,015,0002,285,568
5Jan 31, 2026 11:176,72083,184,66652,787,0002,987,0002,502,656
6Jan 31, 2026 11:176,72384,745,67352,816,0002,989,0002,277,376
7Jan 31, 2026 11:176,72983,224,75754,852,000997,0002,424,832
8Jan 31, 2026 11:176,74982,366,18552,017,0004,001,0002,469,888
9Jan 31, 2026 11:176,77387,292,51851,197,0005,019,0002,314,240
10Jan 31, 2026 11:176,79279,158,87755,364,0001,006,0002,367,488
11Jan 31, 2026 11:176,79284,225,55353,351,0003,019,0002,498,560
12Jan 31, 2026 11:176,80277,211,31353,429,0003,024,0002,322,432