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 12, 2026 15:30Kevin HeaveyKevin HeaveyScore: 3,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:333,89341,943,06631,038,0001,281,0002,117,632
2Jul 12, 2026 15:333,89941,956,57831,123,0001,242,0002,117,632
3Jul 12, 2026 15:333,90441,933,55831,192,0001,219,0002,117,632
4Jul 12, 2026 15:333,91050,871,79131,435,0001,019,0002,117,632
5Jul 12, 2026 15:333,97842,589,04531,807,0001,218,0002,117,632
6Jul 12, 2026 15:333,98142,578,38731,819,0001,225,0002,117,632
7Jul 12, 2026 15:334,07743,464,27232,813,0001,031,0002,117,632
8Jul 12, 2026 15:334,08343,489,95432,865,0001,031,0002,117,632
9Jul 12, 2026 15:334,08645,301,15132,686,0001,228,0002,121,728