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 30, 2026 19:19Josu San MartinJosu San MartinScore: 4,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:214,83048,584,51238,992,0001,104,0002,113,536
2Aug 30, 2026 19:214,83148,565,47039,100,0001,005,0002,113,536
3Aug 30, 2026 19:214,83448,595,20439,010,0001,114,0002,113,536
4Aug 30, 2026 19:214,83548,637,31239,007,0001,128,0002,113,536
5Aug 30, 2026 19:214,83848,629,60139,058,0001,102,0002,113,536
6Aug 30, 2026 19:214,84748,648,42539,100,0001,131,0002,113,536
7Aug 30, 2026 19:214,84956,563,67639,093,0001,154,0002,113,536
8Aug 30, 2026 19:214,85457,538,03739,145,0001,149,0002,113,536
9Aug 30, 2026 19:214,86858,009,82339,367,0001,039,0002,113,536