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 listJul 6, 2026 08:18Teow Hua JunTeow Hua JunScore: 12,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 08:2312,552113,642,672103,093,0001,095,0002,113,536
2Jul 6, 2026 08:2312,573113,823,553103,194,0001,168,0002,113,536
3Jul 6, 2026 08:2312,582113,793,809103,272,0001,165,0002,113,536
4Jul 6, 2026 08:2312,582113,830,737103,263,0001,172,0002,113,536
5Jul 6, 2026 08:2312,590113,911,961103,328,0001,174,0002,113,536
6Jul 6, 2026 08:2312,629114,224,122103,637,0001,190,0002,113,536
7Jul 6, 2026 08:2312,858116,165,268105,650,0001,079,0002,113,536
8Jul 6, 2026 08:2312,892116,369,388105,920,0001,091,0002,113,536
9Jul 6, 2026 08:2312,896116,444,359105,864,0001,179,0002,113,536