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 listJan 23, 2025 15:44Lukas EschbacherLukas EschbacherScore: 387,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 15:44386,7643,237,977,9363,140,180,00069,959,0002,281,472
2Jan 23, 2025 15:44387,3243,247,012,8203,150,835,00063,956,0002,363,392
3Jan 23, 2025 15:44387,3323,241,832,5093,154,894,00059,959,0002,281,472
4Jan 23, 2025 15:44387,7063,246,617,3703,149,983,00067,978,0002,281,472
5Jan 23, 2025 15:44387,7313,247,981,0583,142,214,00075,956,0002,281,472
6Jan 23, 2025 15:44387,8363,241,544,2563,154,078,00064,960,0002,289,664
7Jan 23, 2025 15:44388,6233,249,379,2673,152,578,00072,990,0002,359,296
8Jan 23, 2025 15:44389,0123,258,415,4683,167,820,00060,977,0002,289,664
9Jan 23, 2025 15:44390,2513,272,949,9343,173,124,00065,961,0002,281,472