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 19, 2026 00:15Omkar SinghOmkar SinghScore: 504,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 00:16503,0094,184,405,8364,110,938,00064,037,0002,113,536
2Jun 19, 2026 00:16503,3424,187,132,7014,110,478,00067,266,0002,113,536
3Jun 19, 2026 00:16504,0084,192,754,4014,119,226,00064,046,0002,113,536
4Jun 19, 2026 00:16504,2264,194,387,9574,120,862,00064,215,0002,113,536
5Jun 19, 2026 00:16504,4504,196,698,4154,122,897,00064,044,0002,113,536
6Jun 19, 2026 00:16504,9584,200,966,0054,127,110,00064,049,0002,113,536
7Jun 19, 2026 00:16505,1554,202,149,4884,124,672,00068,115,0002,113,536
8Jun 19, 2026 00:16507,4614,221,682,3924,147,888,00064,046,0002,113,536
9Jun 19, 2026 00:16507,9284,225,744,0274,149,730,00066,075,0002,113,536