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:55M-RochatM-RochatScore: 12,735Success
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:5612,679114,032,746103,094,0002,147,0002,113,536
2May 17, 2026 01:5612,705115,643,742103,258,0002,197,0002,113,536
3May 17, 2026 01:5612,715116,032,795102,352,0003,184,0002,113,536
4May 17, 2026 01:5612,728114,624,414102,439,0003,205,0002,113,536
5May 17, 2026 01:5612,735116,442,968102,475,0003,233,0002,113,536
6May 17, 2026 01:5612,736116,395,630102,541,0003,171,0002,113,536
7May 17, 2026 01:5612,744116,340,304102,620,0003,162,0002,113,536
8May 17, 2026 01:5612,769116,350,299103,774,0002,210,0002,113,536
9May 17, 2026 01:5612,779114,943,518102,935,0003,136,0002,113,536