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 14, 2026 16:08matsuoka-601matsuoka-601Score: 5,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 16:085,35370,242,83643,421,0001,009,0002,330,624
2Mar 14, 2026 16:085,36166,787,48442,478,0002,022,0002,289,664
3Mar 14, 2026 16:085,37571,666,99143,600,0001,013,0002,469,888
4Mar 14, 2026 16:085,37972,924,39243,629,0001,014,0002,441,216
5Mar 14, 2026 16:085,40276,965,65442,844,0001,992,0002,289,664
6Mar 14, 2026 16:085,40767,121,85042,882,0001,994,0002,351,104
7Mar 14, 2026 16:085,41268,298,63742,925,0001,996,0002,334,720
8Mar 14, 2026 16:085,41873,743,49642,968,0001,998,0002,338,816
9Mar 14, 2026 16:085,43468,263,81743,097,0002,004,0002,289,664