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 5, 2026 20:52Kevin HeaveyKevin HeaveyScore: 4,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:534,56747,441,31736,723,0001,187,0002,117,632
2Jul 5, 2026 20:534,58047,587,27636,846,0001,174,0002,117,632
3Jul 5, 2026 20:534,60047,740,61437,045,0001,140,0002,117,632
4Jul 5, 2026 20:534,61049,237,77137,111,0001,159,0002,117,632
5Jul 5, 2026 20:534,61255,190,49237,010,0001,271,0002,121,728
6Jul 5, 2026 20:534,64448,138,59637,316,0001,232,0002,117,632
7Jul 5, 2026 20:534,73248,813,79938,116,0001,167,0002,117,632
8Jul 5, 2026 20:534,73348,847,74838,131,0001,154,0002,117,632
9Jul 5, 2026 20:535,01761,669,67140,623,0001,019,0002,117,632