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 listJan 3, 2026 02:06Josu San MartinJosu San MartinScore: 5,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:065,37973,191,75842,615,0002,029,0002,506,752
2Jan 3, 2026 02:065,39974,259,49543,818,000995,0002,379,776
3Jan 3, 2026 02:065,51274,413,46243,764,0001,989,0002,523,136
4Jan 3, 2026 02:065,67371,622,77445,086,0002,003,0002,281,472
5Jan 3, 2026 02:065,82273,075,66348,320,00002,363,392
6Jan 3, 2026 02:066,00275,642,74047,821,0001,992,0002,486,272