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 listApr 24, 2026 15:54Charles CabergsCharles CabergsScore: 20,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 15:5420,205183,974,402165,706,0001,996,0002,306,048
2Apr 24, 2026 15:5420,206183,396,980165,720,0001,996,0002,306,048
3Apr 24, 2026 15:5420,217183,429,667165,812,0001,997,0002,306,048
4Apr 24, 2026 15:5420,217181,733,102165,810,0001,997,0002,367,488
5Apr 24, 2026 15:5420,220181,429,878166,825,0001,004,0002,363,392
6Apr 24, 2026 15:5420,232185,892,918165,930,0001,999,0002,371,584
7Apr 24, 2026 15:5420,234189,546,734165,948,0001,999,0002,367,488
8Apr 24, 2026 15:5420,920187,699,300171,648,0001,995,0002,310,144
9Apr 24, 2026 15:5420,936191,947,695171,776,0001,997,0002,441,216