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 listMay 7, 2026 08:50wnwnScore: 3,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:503,38243,171,93827,007,0001,068,0002,490,368
2May 7, 2026 08:503,38346,130,15227,017,0001,064,0002,490,368
3May 7, 2026 08:503,41144,296,46727,237,0001,076,0002,490,368
4May 7, 2026 08:503,44344,652,46527,493,0001,092,0002,490,368
5May 7, 2026 08:503,45141,141,18427,593,0001,057,0002,482,176
6May 7, 2026 08:503,54346,575,11528,328,0001,083,0002,486,272
7May 7, 2026 08:503,56147,617,96228,470,0001,087,0002,490,368
8May 7, 2026 08:503,56746,687,15228,512,0001,098,0002,486,272
9May 7, 2026 08:503,59045,258,90928,696,0001,103,0002,486,272