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 2, 2026 08:23wnwnScore: 6,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 08:235,83869,326,23247,448,0001,009,0002,277,376
2Mar 2, 2026 08:235,84969,648,35147,533,0001,011,0002,490,368
3Mar 2, 2026 08:235,85771,409,94947,599,0001,012,0002,490,368
4Mar 2, 2026 08:256,36475,056,02850,828,0001,993,0002,482,176
5Mar 2, 2026 08:256,39176,360,50151,045,0002,001,0002,277,376
6Mar 2, 2026 08:256,40577,334,15651,156,0002,006,0002,494,464