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 14, 2026 22:05Ondřej PolaneckýOndřej PolaneckýScore: 48,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:0547,921416,137,507335,788,00061,960,0002,273,280
2Mar 14, 2026 22:0548,004424,844,283340,370,00058,063,0002,269,184
3Mar 14, 2026 22:0548,038423,666,918338,756,00059,956,0002,400,256
4Mar 14, 2026 22:0548,151423,818,209339,705,00059,947,0002,408,448
5Mar 14, 2026 22:0548,217429,716,964336,166,00064,031,0002,404,352
6Mar 14, 2026 22:0548,238426,070,930340,469,00059,906,0002,400,256