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 19:36wnwnScore: 4,320Success
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 19:364,28159,060,25434,518,0001,015,0002,273,280
2Mar 17, 2026 19:364,28258,466,95934,524,0001,015,0002,494,464
3Mar 17, 2026 19:364,28558,249,00134,553,0001,016,0002,494,464
4Mar 17, 2026 19:364,32061,510,19933,863,0001,991,0002,494,464
5Mar 17, 2026 19:364,34057,075,28434,019,0002,001,0002,498,560
6Mar 17, 2026 19:364,77965,912,44138,650,0001,017,0002,486,272