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 listMay 17, 2026 01:54M-RochatM-RochatScore: 12,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5412,809115,560,462104,147,0002,172,0002,113,536
2May 17, 2026 01:5412,836115,375,257103,361,0003,179,0002,113,536
3May 17, 2026 01:5412,843116,965,809104,388,0002,211,0002,113,536
4May 17, 2026 01:5412,863116,854,616104,558,0002,212,0002,113,536
5May 17, 2026 01:5412,866115,723,558104,596,0002,197,0002,113,536
6May 17, 2026 01:5412,875117,420,177104,697,0002,167,0002,113,536
7May 17, 2026 01:5412,879115,714,630103,618,0003,281,0002,113,536
8May 17, 2026 01:5412,880118,219,617103,683,0003,224,0002,113,536
9May 17, 2026 01:5412,924119,331,675105,082,0002,190,0002,113,536