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 4, 2026 19:39boop34boop34Score: 8,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 19:398,24978,295,90667,235,0001,232,0002,113,536
2Aug 4, 2026 19:398,26578,403,87567,399,0001,204,0002,113,536
3Aug 4, 2026 19:398,26578,543,78167,410,0001,192,0002,113,536
4Aug 4, 2026 19:398,26978,587,37767,427,0001,209,0002,113,536
5Aug 4, 2026 19:398,28678,681,23867,577,0001,200,0002,113,536
6Aug 4, 2026 19:398,32378,986,41867,866,0001,218,0002,113,536
7Aug 4, 2026 19:398,34979,163,74768,053,0001,249,0002,113,536
8Aug 4, 2026 19:398,35179,083,71868,127,0001,191,0002,113,536
9Aug 4, 2026 19:398,48580,292,33969,199,0001,233,0002,113,536