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 17, 2026 15:16wnwnScore: 4,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 15:164,23859,172,36033,169,0002,010,0002,273,280
2Mar 17, 2026 15:164,25456,774,96034,303,0001,008,0002,273,280
3Mar 17, 2026 15:164,25559,951,38134,306,0001,009,0002,486,272
4Mar 17, 2026 15:164,26156,212,51434,357,0001,010,0002,273,280
5Mar 17, 2026 15:164,29059,021,97734,591,0001,017,0002,482,176
6Mar 17, 2026 15:164,30263,211,10034,684,0001,020,0002,273,280