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 listApr 6, 2026 17:37Danylo MocherniukDanylo MocherniukScore: 5,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 17:375,76875,472,17945,879,0001,994,0002,392,064
2Apr 6, 2026 17:365,78571,924,10546,018,0002,000,0002,404,352
3Apr 6, 2026 17:365,79868,539,00746,119,0002,005,0002,400,256
4Apr 6, 2026 17:375,80169,433,62846,141,0002,006,0002,297,856
5Apr 6, 2026 17:375,80469,705,74447,168,0001,003,0002,400,256
6Apr 6, 2026 17:365,86475,802,38148,672,00002,297,856