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 listJul 18, 2026 13:02boop34boop34Score: 9,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:059,18886,143,21375,218,0001,050,0002,113,536
2Jul 18, 2026 13:059,20086,192,83775,292,0001,071,0002,113,536
3Jul 18, 2026 13:059,21086,133,43575,408,0001,038,0002,113,536
4Jul 18, 2026 13:059,22688,765,81375,525,0001,052,0002,113,536
5Jul 18, 2026 13:059,23086,491,27475,535,0001,078,0002,113,536
6Jul 18, 2026 13:059,24987,173,28775,695,0001,076,0002,113,536
7Jul 18, 2026 13:059,25787,416,75375,791,0001,050,0002,113,536
8Jul 18, 2026 13:059,33287,353,35176,380,0001,078,0002,113,536
9Jul 18, 2026 13:059,47689,168,67577,595,0001,056,0002,113,536