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 21, 2026 11:15Daniel MastalerzDaniel MastalerzScore: 6,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 11:526,48676,669,60147,851,0005,981,0002,265,088
2Feb 21, 2026 11:156,50982,515,11148,024,0006,003,0002,514,944
3Feb 21, 2026 11:156,51075,078,25048,031,0006,003,0002,273,280
4Feb 21, 2026 11:526,53279,573,52148,193,0006,024,0002,330,624
5Feb 21, 2026 11:156,55780,640,89752,407,0002,015,0002,322,432
6Feb 21, 2026 11:156,55977,159,95348,393,0006,049,0002,351,104
7Feb 21, 2026 11:526,57193,828,82848,480,0006,060,0002,277,376
8Feb 21, 2026 11:156,59284,925,06849,743,0004,974,0002,326,528
9Feb 21, 2026 11:156,65578,176,99950,216,0005,021,0002,334,720