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 29, 2026 19:05wnwnScore: 4,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 19:154,25258,037,31733,278,0002,016,0002,482,176
2Mar 27, 2026 17:454,25656,074,15634,316,0001,009,0002,277,376
3Mar 31, 2026 19:154,26259,924,51134,365,0001,010,0002,486,272
4Mar 27, 2026 17:454,26558,344,88034,389,0001,011,0002,494,464
5Mar 31, 2026 19:154,26957,002,50634,417,0001,012,0002,494,464
6Mar 27, 2026 17:454,28155,357,47834,521,0001,015,0002,277,376
7Mar 29, 2026 19:054,28965,340,42934,582,0001,017,0002,277,376
8Mar 27, 2026 17:454,29663,116,61934,637,0001,018,0002,277,376
9Mar 27, 2026 17:454,31860,923,94733,846,0001,990,0002,494,464
10Mar 27, 2026 17:454,32357,602,11133,892,0001,993,0002,490,368
11Mar 29, 2026 19:054,32461,651,45033,896,0001,993,0002,498,560
12Mar 29, 2026 19:054,32557,720,34434,872,0001,025,0002,277,376