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 listMay 23, 2026 21:20Maya RebholzMaya RebholzScore: 8,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 21:208,38280,290,26663,144,0006,429,0002,117,632
2May 23, 2026 21:208,45879,724,49263,714,0006,492,0002,117,632
3May 23, 2026 21:208,47379,529,05563,698,0006,635,0002,117,632
4May 23, 2026 21:208,49580,652,60063,778,0006,734,0002,121,728
5May 23, 2026 21:208,51181,602,25063,909,0006,737,0002,121,728
6May 23, 2026 21:208,58082,118,97164,444,0006,775,0002,117,632
7May 23, 2026 21:208,58281,450,86364,226,0007,010,0002,117,632
8May 23, 2026 21:208,58682,722,89764,397,0006,868,0002,117,632
9May 23, 2026 21:208,64981,715,91064,829,0006,958,0002,121,728