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 listApr 7, 2026 06:48Sanketh B KSanketh B KScore: 68,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2026 06:4868,510596,296,227513,669,00054,964,0002,281,472
2Apr 7, 2026 06:4868,587594,532,414510,241,00059,027,0002,281,472
3Apr 7, 2026 06:4868,629596,825,250508,660,00060,959,0002,412,544
4Apr 7, 2026 06:4868,638595,028,526504,732,00064,965,0002,273,280
5Apr 7, 2026 06:4868,673593,655,110508,984,00060,998,0002,408,448
6Apr 7, 2026 06:4868,712599,444,098510,379,00059,927,0002,281,472
7Apr 7, 2026 06:4868,849602,794,355514,401,00057,044,0002,408,448
8Apr 7, 2026 06:4868,861603,592,232512,593,00058,953,0002,281,472
9Apr 7, 2026 06:4868,870594,028,705509,659,00061,958,0002,281,472