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 listJun 29, 2026 07:57Victor MerckléVictor MerckléScore: 4,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 07:584,76047,276,68738,502,0001,009,0002,113,536
2Jun 29, 2026 07:584,79247,537,59038,771,0001,003,0002,113,536
3Jun 29, 2026 07:584,79747,625,93938,794,0001,028,0002,113,536
4Jun 29, 2026 07:584,82247,880,89139,021,0001,009,0002,113,536
5Jun 29, 2026 07:584,86948,208,12539,407,0001,010,0002,113,536
6Jun 29, 2026 07:584,87949,649,52839,492,0001,006,0002,113,536
7Jun 29, 2026 07:584,88848,352,09939,575,0001,001,0002,113,536
8Jun 29, 2026 07:584,98249,072,56340,350,0001,001,0002,113,536
9Jun 29, 2026 07:585,09950,202,13041,306,0001,020,0002,113,536