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 13:10wnwnScore: 4,350Success
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 13:114,33760,618,66033,994,0001,999,0002,273,280
2Mar 18, 2026 13:104,34159,752,76234,028,0002,001,0002,273,280
3Mar 18, 2026 13:114,34857,881,53834,083,0002,004,0002,273,280
4Mar 18, 2026 13:124,34960,497,82834,093,0002,005,0002,494,464
5Mar 18, 2026 13:124,35060,257,09234,102,0002,006,0002,273,280
6Mar 18, 2026 13:124,36061,476,35134,174,0002,010,0002,273,280
7Mar 18, 2026 13:104,36656,363,37034,221,0002,013,0002,273,280
8Mar 18, 2026 13:104,40356,466,63635,528,0001,015,0002,490,368
9Mar 18, 2026 13:114,41662,774,37935,636,0001,018,0002,273,280