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 18, 2026 10:07Joel ChongJoel ChongScore: 49,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 10:0749,632435,532,591409,945,0001,999,0002,277,376
2Mar 18, 2026 10:0749,705439,815,296411,553,000998,0002,285,568
3Mar 18, 2026 10:0749,710439,272,411410,595,0001,998,0002,523,136
4Mar 18, 2026 10:0749,733435,689,831410,787,0001,998,0002,285,568
5Mar 18, 2026 10:0749,767443,267,955412,069,0001,000,0002,285,568
6Mar 18, 2026 10:0749,834443,839,072411,624,0001,998,0002,289,664
7Mar 18, 2026 10:0749,836439,318,789412,640,000999,0002,523,136
8Mar 18, 2026 10:0749,854437,017,179411,792,0001,998,0002,265,088
9Mar 18, 2026 10:0749,905436,955,218413,213,0001,000,0002,285,568