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 18, 2026 19:10wnwnScore: 7,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 19:106,19875,926,37347,407,0004,034,0002,527,232
2Feb 18, 2026 19:106,21070,699,13349,522,0002,021,0002,281,472
3Feb 18, 2026 19:106,25279,404,18249,893,0001,995,0002,506,752
4Feb 18, 2026 19:107,03977,826,19156,413,0002,014,0002,433,024
5Feb 18, 2026 19:107,10585,879,33556,972,0001,999,0002,437,120
6Feb 18, 2026 19:107,20488,144,74257,799,0001,993,0002,490,368