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 listAug 10, 2026 21:22Lan Hoang DaoLan Hoang DaoScore: 58,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 21:2258,168492,867,202424,259,00058,536,0002,113,536
2Aug 10, 2026 21:2258,182493,694,038425,229,00057,684,0002,113,536
3Aug 10, 2026 21:2258,200493,750,019424,290,00058,773,0002,113,536
4Aug 10, 2026 21:2258,202494,361,320424,249,00058,830,0002,113,536
5Aug 10, 2026 21:2258,215494,066,030424,338,00058,847,0002,113,536
6Aug 10, 2026 21:2258,239495,345,365424,241,00059,146,0002,113,536
7Aug 10, 2026 21:2258,257493,635,598424,243,00059,298,0002,113,536
8Aug 10, 2026 21:2258,262493,648,988425,025,00058,550,0002,113,536
9Aug 10, 2026 21:2258,293496,608,174425,289,00058,548,0002,113,536