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 6, 2026 15:34chereshnya123chereshnya123Score: 65,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:3565,032548,935,418482,747,00057,026,0002,113,536
2Jun 6, 2026 15:3565,098549,473,361482,658,00057,658,0002,113,536
3Jun 6, 2026 15:3565,128549,575,069482,762,00057,803,0002,113,536
4Jun 6, 2026 15:3565,160549,959,333482,769,00058,059,0002,113,536
5Jun 6, 2026 15:3565,202550,376,218482,870,00058,314,0002,113,536
6Jun 6, 2026 15:3565,223550,458,606482,621,00058,731,0002,113,536
7Jun 6, 2026 15:3565,281550,903,934482,802,00059,032,0002,113,536
8Jun 6, 2026 15:3565,359551,637,180482,825,00059,659,0002,113,536
9Jun 6, 2026 15:3565,460552,592,296482,395,00060,931,0002,113,536