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 listOct 16, 2026 18:21KacpxerKacpxerScore: 7,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:217,58673,434,53161,856,0001,114,0002,117,632
2Oct 16, 2026 18:217,58972,095,93461,885,0001,109,0002,117,632
3Oct 16, 2026 18:217,60372,168,52862,061,0001,050,0002,117,632
4Oct 16, 2026 18:217,60777,670,27462,031,0001,110,0002,117,632
5Oct 16, 2026 18:217,61372,290,85262,091,0001,103,0002,117,632
6Oct 16, 2026 18:217,62072,366,76962,150,0001,103,0002,117,632
7Oct 16, 2026 18:217,62372,349,88462,170,0001,104,0002,117,632
8Oct 16, 2026 18:217,66372,731,05762,490,0001,114,0002,117,632
9Oct 16, 2026 18:217,85274,247,38264,061,0001,114,0002,117,632