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 listMar 29, 2026 20:06Danylo MocherniukDanylo MocherniukScore: 7,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 20:067,76890,976,89462,458,0002,014,0002,506,752
2Mar 29, 2026 20:067,78097,075,45364,574,00002,293,760
3Mar 29, 2026 20:067,78295,607,32163,579,0001,009,0002,510,848
4Mar 29, 2026 20:067,80797,417,89862,802,0001,993,0002,506,752
5Mar 29, 2026 20:067,80888,712,02663,809,000997,0002,506,752
6Mar 29, 2026 20:067,81291,126,22463,846,000997,0002,293,760
7Mar 29, 2026 20:067,81390,665,62963,833,0001,013,0002,506,752
8Mar 29, 2026 20:067,82785,576,61262,965,0001,998,0002,293,760
9Mar 29, 2026 20:067,82888,441,78462,973,0001,999,0002,289,664