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 27, 2026 02:31wnwnScore: 3,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 02:313,39745,132,73827,196,0001,007,0002,490,368
2Apr 27, 2026 02:313,42845,826,55927,437,0001,016,0002,482,176
3Apr 27, 2026 02:313,43542,991,35227,499,0001,018,0002,490,368
4Apr 27, 2026 02:313,44346,946,44627,561,0001,020,0002,490,368
5Apr 27, 2026 02:313,44546,375,22227,573,0001,021,0002,473,984
6Apr 27, 2026 02:313,48447,334,48726,929,0001,994,0002,494,464
7Apr 27, 2026 02:313,50350,066,20727,074,0002,005,0002,490,368
8Apr 27, 2026 02:313,53646,181,80228,343,0001,012,0002,482,176
9Apr 27, 2026 02:313,61144,446,39727,976,0001,998,0002,482,176