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 17:56Lan Hoang DaoLan Hoang DaoScore: 213,189Success
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 17:57213,0561,779,238,4911,704,299,00064,067,0002,113,536
2Aug 10, 2026 17:57213,0841,778,673,1271,703,539,00065,061,0002,113,536
3Aug 10, 2026 17:57213,1481,779,265,3121,704,069,00065,060,0002,113,536
4Aug 10, 2026 17:57213,1551,779,264,3561,704,131,00065,057,0002,113,536
5Aug 10, 2026 17:57213,1891,780,295,7211,704,396,00065,073,0002,113,536
6Aug 10, 2026 17:57213,4021,782,147,8491,704,174,00067,069,0002,113,536
7Aug 10, 2026 17:57213,4301,782,404,0501,704,407,00067,070,0002,113,536
8Aug 10, 2026 17:57213,4601,781,826,5451,703,599,00068,119,0002,113,536
9Aug 10, 2026 17:57213,4611,782,000,8881,703,664,00068,063,0002,113,536