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 listApr 24, 2026 13:51TudyMTudyMScore: 94,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 13:5194,568800,814,430722,927,00061,993,0002,310,144
2Apr 24, 2026 13:5194,580799,967,339723,017,00062,001,0002,363,392
3Apr 24, 2026 13:5194,603800,783,754729,197,00056,015,0002,371,584
4Apr 24, 2026 13:5194,609807,967,022724,236,00061,019,0002,371,584
5Apr 24, 2026 13:5194,629804,180,405723,473,00061,954,0002,367,488
6Apr 24, 2026 13:5194,639802,838,091724,549,00060,962,0002,306,048
7Apr 24, 2026 13:5194,639805,557,250723,550,00061,961,0002,326,528
8Apr 24, 2026 13:5194,640803,862,957722,559,00062,961,0002,363,392
9Apr 24, 2026 13:5194,739807,098,426728,314,00058,025,0002,375,680