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 listMar 10, 2026 17:44Sergey SerebryakovSergey SerebryakovScore: 8,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:448,14494,509,40266,589,0001,008,0002,273,280
2Mar 10, 2026 17:448,16494,338,60865,771,0001,993,0002,273,280
3Mar 10, 2026 17:448,29297,116,51066,827,0001,994,0002,273,280
4Mar 10, 2026 17:448,92595,896,25372,077,0002,002,0002,387,968
5Mar 10, 2026 17:449,08798,795,69274,414,0001,005,0002,400,256
6Mar 10, 2026 17:449,131100,202,59873,792,0001,994,0002,396,160