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 listAug 10, 2026 18:56Lan Hoang DaoLan Hoang DaoScore: 100,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 18:5699,959839,651,061771,319,00058,347,0002,113,536
2Aug 10, 2026 18:56100,295842,575,727773,723,00058,732,0002,113,536
3Aug 10, 2026 18:56100,388843,243,699775,040,00058,181,0002,113,536
4Aug 10, 2026 18:56100,397843,353,633775,390,00057,907,0002,113,536
5Aug 10, 2026 18:56100,526844,431,336776,489,00057,884,0002,113,536
6Aug 10, 2026 18:56100,636845,369,996777,289,00057,996,0002,113,536
7Aug 10, 2026 18:56100,642845,399,357777,284,00058,046,0002,113,536
8Aug 10, 2026 18:56100,661845,516,009777,320,00058,169,0002,113,536
9Aug 10, 2026 18:56100,786846,584,325775,825,00060,701,0002,113,536