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 14, 2026 19:07marko1597marko1597Score: 108,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 19:38107,805905,482,858893,523,0001,261,0002,117,632stderr
2Aug 14, 2026 19:38107,951906,782,413894,760,0001,235,0002,117,632stderr
3Aug 14, 2026 19:38108,152910,509,756896,432,0001,234,0002,117,632stderr
4Aug 14, 2026 19:38108,334909,359,544897,156,0002,022,0002,117,632stderr
5Aug 14, 2026 19:38108,695912,258,737900,915,0001,254,0002,117,632stderr
6Aug 14, 2026 19:38108,721912,430,665901,385,0001,003,0002,117,632stderr
7Aug 14, 2026 19:38108,933914,868,468902,899,0001,250,0002,117,632stderr
8Aug 14, 2026 19:38109,045915,922,460904,054,0001,024,0002,117,632stderr
9Aug 14, 2026 19:38109,475919,547,191906,619,0002,031,0002,117,632stderr