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 listFeb 10, 2026 19:41Daniel MastalerzDaniel MastalerzScore: 8,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:418,22791,898,07365,272,0003,012,0002,269,184
2Feb 10, 2026 19:418,23692,809,92364,338,0004,021,0002,273,280
3Feb 10, 2026 19:418,24988,364,25366,457,0002,013,0002,367,488
4Feb 10, 2026 19:418,39394,096,70366,632,0003,028,0002,273,280
5Feb 10, 2026 19:418,407101,515,72368,779,000996,0002,277,376
6Feb 10, 2026 19:418,40996,894,20665,806,0003,988,0002,265,088