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 listSep 12, 2026 14:57Kevin HeaveyKevin HeaveyScore: 56,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 14:5856,094475,891,068464,448,0001,135,0002,117,632
2Sep 12, 2026 14:5856,100475,930,387464,470,0001,163,0002,117,632
3Sep 12, 2026 14:5856,108475,930,722464,636,0001,062,0002,117,632
4Sep 12, 2026 14:5856,112476,118,138464,708,0001,024,0002,117,632
5Sep 12, 2026 14:5856,158476,424,939465,061,0001,058,0002,117,632
6Sep 12, 2026 14:5856,172476,393,016465,106,0001,123,0002,117,632
7Sep 12, 2026 14:5856,173476,522,624465,012,0001,232,0002,117,632
8Sep 12, 2026 14:5856,185476,536,625465,333,0001,006,0002,117,632
9Sep 12, 2026 14:5856,210476,821,926465,408,0001,140,0002,117,632