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 13, 2026 18:01M-RochatM-RochatScore: 19,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:0119,548171,178,617161,225,0001,027,0002,113,536
2May 13, 2026 18:0119,615171,552,057161,778,0001,031,0002,113,536
3May 13, 2026 18:0119,649172,354,193162,062,0001,032,0002,113,536
4May 13, 2026 18:0119,656173,512,440162,136,0001,015,0002,113,536
5May 13, 2026 18:0119,687173,612,102162,365,0001,039,0002,113,536
6May 13, 2026 18:0119,714172,557,023162,595,0001,033,0002,113,536
7May 13, 2026 18:0119,756174,586,166162,968,0001,015,0002,113,536
8May 13, 2026 18:0119,910173,950,318164,232,0001,024,0002,113,536
9May 13, 2026 18:0120,152176,487,057166,233,0001,036,0002,113,536