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 08:34Teow Hua JunTeow Hua JunScore: 7,006Success
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 08:346,99568,058,09656,956,0001,107,0002,113,536
2Aug 4, 2026 08:346,99868,944,63156,940,0001,145,0002,113,536
3Aug 4, 2026 08:347,00568,465,03857,004,0001,142,0002,113,536
4Aug 4, 2026 08:347,00668,262,84157,027,0001,124,0002,113,536
5Aug 4, 2026 08:347,00671,363,34657,050,0001,100,0002,113,536
6Aug 4, 2026 08:347,00768,947,84757,018,0001,142,0002,113,536
7Aug 4, 2026 08:347,01868,298,47957,125,0001,129,0002,113,536
8Aug 4, 2026 08:347,02868,322,09057,201,0001,134,0002,113,536
9Aug 4, 2026 08:347,09368,883,72457,763,0001,109,0002,113,536