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 listJan 9, 2026 22:00Alexander FrolovAlexander FrolovScore: 47,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 22:0047,421421,445,575391,595,0001,997,0002,490,368
2Jan 9, 2026 22:0047,434416,252,215391,706,0001,998,0002,277,376
3Jan 9, 2026 22:0047,434417,287,130391,703,0001,998,0002,277,376
4Jan 9, 2026 22:0047,446421,427,037391,804,0001,999,0002,482,176
5Jan 9, 2026 22:0047,802420,172,781394,757,0001,998,0002,277,376
6Jan 9, 2026 22:0047,811419,402,651394,835,0001,999,0002,277,376
7Jan 9, 2026 22:0047,817420,200,572394,879,0001,999,0002,490,368
8Jan 9, 2026 22:0047,834424,490,043395,026,0002,000,0002,473,984
9Jan 9, 2026 22:0047,846420,838,743396,122,0001,000,0002,535,424