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 listFeb 19, 2026 14:04lolrdor1gamerlolrdor1gamerScore: 36,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 14:0436,138333,078,091298,950,000999,0002,527,232
2Feb 19, 2026 14:0436,144327,913,403298,999,000999,0002,523,136
3Feb 19, 2026 14:0436,155326,569,784298,088,0002,000,0002,523,136
4Feb 19, 2026 14:0436,176322,892,279299,262,0001,000,0002,265,088
5Feb 19, 2026 14:0436,181326,142,872300,301,00002,379,776
6Feb 19, 2026 14:0436,182328,667,172300,314,00002,392,064
7Feb 19, 2026 14:0436,185323,242,395299,338,0001,001,0002,379,776
8Feb 19, 2026 14:0436,370324,853,385298,872,0002,998,0002,527,232
9Feb 19, 2026 14:0436,630330,141,941302,029,0002,000,0002,375,680