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 26, 2026 15:40wnwnScore: 3,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:403,44446,959,12827,567,0001,021,0002,486,272
2Apr 26, 2026 15:403,45642,248,70827,662,0001,024,0002,560,000
3Apr 26, 2026 15:403,53445,088,27528,322,0001,011,0002,482,176
4Apr 26, 2026 15:403,58346,040,23827,761,0001,982,0002,490,368
5Apr 26, 2026 15:403,65348,596,37629,312,0001,010,0002,490,368
6Apr 26, 2026 15:403,76246,759,81230,222,0001,007,0002,490,368
7Apr 26, 2026 15:403,83250,208,63529,819,0001,987,0002,314,240
8Apr 26, 2026 15:403,88147,298,06031,212,0001,006,0002,494,464
9Apr 26, 2026 15:404,27150,063,52831,399,0004,051,0002,297,856