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 listDec 3, 2025 18:41Rajarshi BasuRajarshi BasuScore: 8,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 18:418,29597,260,97466,853,0001,995,0002,289,664
2Dec 3, 2025 18:418,311103,467,79466,985,0001,999,0002,490,368
3Dec 3, 2025 18:418,31190,515,77165,984,0002,999,0002,289,664
4Dec 3, 2025 18:418,47295,321,64968,310,0002,009,0002,289,664
5Dec 3, 2025 18:418,49095,450,48869,462,0001,006,0002,289,664
6Dec 3, 2025 18:418,680103,366,10470,047,0002,001,0002,486,272